Revisiting parametric multi-terminal problems: Maximum flows, minimum cuts and cut-tree computations
نویسندگان
چکیده
منابع مشابه
Maximum Flows and Minimum Cuts
In the mid-1950s, U. S. Air Force researcher Theodore E. Harris and retired U. S. Army general Frank S. Ross published a classified report studying the rail network that linked the Soviet Union to its satellite countries in Eastern Europe. The network was modeled as a graph with 44 vertices, representing geographic regions, and 105 edges, representing links between those regions in the rail net...
متن کاملMaximum Flows and Minimum Cuts
In the mid-1950s, U. S. Air Force researcher Theodore E. Harris and retired U. S. Army general Frank S. Ross published a classified report studying the rail network that linked the Soviet Union to its satellite countries in Eastern Europe. The network was modeled as a graph with 44 vertices, representing geographic regions, and 105 edges, representing links between those regions in the rail net...
متن کامل23 Maximum Flows and Minimum Cuts
In the mid-1950s, Air Force researcher Theodore E. Harris and retired army general Frank S. Ross published a classified report studying the rail network that linked the Soviet Union to its satellite countries in Eastern Europe. The network was modeled as a graph with 44 vertices, representing geographic regions, and 105 edges, representing links between those regions in the rail network. Each e...
متن کاملSolving Project Scheduling Problems by Minimum Cut Computations Solving Project Scheduling Problems by Minimum Cut Computations †
In project scheduling, a set of precedence-constrained jobs has to be scheduled so as to minimize a given objective. In resource-constrained project scheduling, the jobs additionally compete for scarce resources. Due to its universality, the latter problem has a variety of applications in manufacturing, production planning, project management, and elsewhere. It is one of the most intractable pr...
متن کاملImproved Minimum Cuts and Maximum Flows in Undirected Planar Graphs
In this paper we study minimum cut and maximum flow problems on planar graphs, both in static and in dynamic settings. First, we present an algorithm that given an undirected planar graph computes the minimum cut between any two given vertices in O(n log logn) time. Second, we show how to achieve the same O(n log logn) bound for the problem of computing maximum flows in undirected planar graphs...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Optimization
سال: 2006
ISSN: 1572-5286
DOI: 10.1016/j.disopt.2006.05.003